Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 737 - Gleaming the cubes / 737 / Main.java
blob876068c131516a46f0c6e178c0bafad473783268
1 import java.io.*;
2 import java.util.*;
4 class Main
6 static BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
7 String s;
8 public static void main (String args[])
10 try{
11 s = stdin.readLine();
12 }catch{}
13 StringTokenizer tokens = new StringTokenizer(s);
14 int t = Integer.parseInt((tokens.nextToken()));
15 long a, b;
16 for (int i=0; i<t; ++i){
17 try{
18 s = stdin.readLine();
19 }catch{}
20 tokens = new StringTokenizer(s);
21 a = Integer.parseInt(tokens.nextToken());
22 b = Integer.parseInt(tokens.nextToken());
23 if (a < b){
24 System.out.println("<");
25 }else if (a > b){
26 System.out.println(">");
27 }else{
28 System.out.println("=");